COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	(RWF: Attach assignment 5, and draw flag program)
C00007 ENDMK
C⊗;
(RWF: Attach assignment 5, and draw flag program)

(1) Instructor's manual, pg. 56.

The flag design used here is, except for character substitutions, identical
to a problem I composed and used as a classroom assignment in Oct. 1982;
see attachments. Notice that the solution which I distributed in 1982
prints the phrase ``Flag of an Unknown Land,'' used as the title of Keller's
Assignment 4-2.

(2) ``A First Course'' (AFC), pg. 29, exercise number 4; also, see solution
page 270.  Notice that the solution, on its sixth line, refers to _diamonds_
rather than triangles, although Keller's problem in no way refers to diamonds.
My ``Notes on Programming in Pascal'' (NPP), on pp. 32-33, give a pair of
exercises, to print what my notes call _diamonds_.  Keller's diagram is the 
top half of mine.  The face that the word ``diamonds'' appears in his solution
suggests that it was originally the solution I distributed to my class.
Etham Bradford, to whom his solution is attributed, was my teaching assistant
at one time.

(3) Compare Section 3-5 of AFC to pp. 65-68 of NPP.  Especially, compare
Keller's sentence ``We cannot ... the rest'' on pg. 36 with my ``Step 1.1
cannot ... f↓24'' on pg. 65, and the program on p. 38 of AFC with that on
pg. 68 of NPP.

(4) Compare Section 3-7 of AFC with pg. 41 of NPP.  Keller attributes the
problem to me.  I did not give him permission to use it.  I asked him not
to use my problems, because I was planning to use them in a book of my own.

(5) Compare Section 4-4 and 4-6 of AFC with pp. 55-56, 59-60, and 63 of NPP.
Also compare the program on pg. 54 of AFC with the five-line program 
fragment on pg. 61 of NPP, and the program on pg. 56 to which it refers.
The illustration of nested conditional structures and logical connectives
using the printing of chess positions and moves as a source of examples
appears to me excessively derivative.

(6) RWF: Track down AFC p. 113.

(7) Page 136 of FCC presents a program for evaluating expressions consisting of
two numbers separated by an operator.  While I cannot locate anything in
writing, I have used this as a classroom example for years.

(8) Page 145 of FCC, Section 11-4, solves a problem (means and standard
deviations) which is a paraphrase of my last exercise (means and average
deviations) on pg. 83 of NPP.

(9) Page 165 of FCC, Section 13-3, is based on another problem I have used
many times as a homework assignment.  I can not locate any written record.

(10) Pp. 171-178 use my standard classroom presentation, for about the past
ten years, of recursion, using the problem of counting connected regions
in a digitized image, even to the point of calling the connected regions
``blobs,'' and showing by the contour (= stack frame) method how to
hand-execute recursive procedures.  See my attachment, which I wrote down
after publication of FCC but before I read Chapter 14.

(11) Compare IM pp. 36-38 with NPP, pp. 27-30.  Especially, compare
``Since I ... three pieces'' with the last paragraph on pg. 27.

(12) Compare IM, pg.39, with NPP, pg. 7, first and fifth exercises.